Comparison of Syntactic Error Handling in LR Parsers
نویسندگان
چکیده
Error recovery techniques for LR parsers presented in the literature are described and classified. The techniques considered range from the non-correcting ones to interactive and incremental ones. Also, some of the techniques presented are compared and evaluated. An example showing the advantages and the disadvantages of each class of strategies is given and is used as a guideline for classifying syntax errors according to the recovery strategies which are more adequate to correct them.
منابع مشابه
Error Recovery in LR Parsers
This report presents a survey of four syntax error recovery techniques for LR Parsers. The techniques presented are described in [Modry 78, Graham 79, Sippu 83, Mckenzie 95, Bertsch 99]. After an introduction to general syntactic error recovery techniques in LR parsers, I would present a brief overview and comparison of these techniques in this report.
متن کاملHow To Obtain Powerful Parsers That Are Elegant and Practical
Most of the functional parsers published today focus on elegance. But they pay for this elegance by neglecting practical requirements such as efficiency and decent error handling. By contrast, a traditional parser (generator) based on LLor LR-principles focuses on efficiency and neglects issues such as elegance and understandability almost entirely. In this paper we combine these pragmatic issu...
متن کاملTaurus, a Parser Generator Producing Error Recovering Parsers in Scheme
A parser generator producing recursive descent LL(1) parsers was implemented. The generated parsers include automatic syntactic error recovery and error reporting. The i mplementation language for both the parser generator and the generated parsers is Scheme.
متن کاملANTLR: A Predicated- LL(k) Parser Generator
Despite the parsing power of LR=LALR algorithms, e.g. YACC 1, programmers often choose to write recursive-descent parsers by hand to obtain increased flexibility, better error handling, and ease of debugging. We introduce ANTLR, a public-domain parser generator that combines the flexibility of hand-coded parsing with the convenience of a parser generator, which is a component of PCCTS 2. ANTLR ...
متن کاملPackrat Parsing: a Practical Linear-Time Algorithm with Backtracking
Packrat parsing is a novel and practical method for implementing linear-time parsers for grammars defined in Top-Down Parsing Language (TDPL). While TDPL was originally created as a formal model for top-down parsers with backtracking capability, this thesis extends TDPL into a powerful general-purpose notation for describing language syntax, providing a compelling alternative to traditional con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 25 شماره
صفحات -
تاریخ انتشار 1995